Closure structures parameterized by systems of isotone Galois connections

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Closure structures parameterized by systems of isotone Galois connections

We study properties of classes of closure operators and closure systems parameterized by systems of isotone Galois connections. The parameterizations express stronger requirements on idempotency and monotony conditions of closure operators. The present approach extends previous approaches to fuzzy closure operators which appeared in analysis of objectattribute data with graded attributes and re...

متن کامل

Generating Isotone Galois Connections on an Unstructured Codomain

Given a mapping f : A → B from a partially ordered set A into an unstructured set B, we study the problem of defining a suitable partial ordering relation on B such that there exists a mapping g : B → A such that the pair of mappings (f, g) forms an isotone Galois connection between partially ordered sets.

متن کامل

Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited

It is well known that concept lattices of isotone and antitone Galois connections induced by an ordinary binary relation and its complement are isomorphic, via a natural isomorphism mapping extents to themselves and intents to their complements. It is also known that in a fuzzy setting, this and similar kinds of reduction fail to hold. In this note, we show that when the usual notion of a compl...

متن کامل

On closure axioms for a matroid using Galois connections∗

We present two systems of closure axioms for a matroid with the assistance of Galois connections. These axioms give a mathematical foundation for the connections between matroids, Galois connections and concept lattices. We deal with some relationship between matroids and geometric lattices by the above axioms. We also discuss some applications between matroids and concept lattices with the abo...

متن کامل

Galois-type Connections and Closure Operations on Preordered Sets

For a function f of one preordered set X to another Y , we shall establish several consequences of the following two definitions: (a) f is increasingly φ–regular, for some function φ of X to itself, if for any x1 , x2 ∈ X we have x1 ≤ φ (x2) if and only if f (x1) ≤ f (x2); (b) f is increasingly g–normal, for some function g of Y to X , if for any x ∈ X and y ∈ Y we have f (x) ≤ y if and only if...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2017

ISSN: 0888-613X

DOI: 10.1016/j.ijar.2017.08.013